Model Checking Hw-Hume
نویسندگان
چکیده
Safety-critical software systems call for effective analysis that ensures the correctness of the systems. HUME is a functional programming language, targeted at safety-critical systems, which supports such analysis for time and space, but does not support verification. This topic is explored by using an off-the-shelf design verification system called SPIN. The result is then empirically analysed.
منابع مشابه
HW-Hume in Isabelle
HW-Hume is the decidable Hume level oriented to direct implementation in hardware. As a first stage in the development of a verified compiler from HW-Hume to Java, we have implemented the semantics of HW-Hume in the Isabelle/HOL theorem prover, enabling the automatic proof of correctness of programs in a Floyd/Hoare style.
متن کاملVerifying Temporal Properties in HW-Hume
H is a modern formally-defined programming language targeted at safety-critical, resource-bounded systems. A key feature of H is the clear separation between computation and coordination, achieved through a finite-state-automata based approach, where a purely functional computation layer is embedded into a reactive coordination layer that manages interactions between processes and with th...
متن کاملLow-Level Programming in Hume: An Exploration of the HW-Hume Level
This paper describes the HW-Hume level of the novel Hume language. HW-Hume is the simplest subset of Hume that we have identified. It provides strong formal properties but posseses limited abstraction capabilities. In this paper, we introduce HW-Hume, show some simple example programs, describe an eÆcient software implementation, and demonstrate how important properties can be exposed as part o...
متن کاملRecursion, Iteration and Hume Scheduling
Converting programs from full or PR-Hume to FSMor HW-Hume involves transforming expression recursion to box iteration. However, this can add considerable overheads through unnecessary scheduling of other boxes dependent on the iteration output. Here we explore how analysis of output behaviour can identify boxes which may be executed independently of normal super-step scheduling, without affecti...
متن کاملApplying Multi-Core Model Checking to Hardware-Software Partitioning in Embedded Systems (extended version)
We present an alternative approach to solve the hardware (HW) and software (SW) partitioning problem, which uses Bounded Model Checking (BMC) based on Satisfiability Modulo Theories (SMT) in conjunction with a multi-core support using Open Multi-Processing. The multi-core SMT-based BMC approach allows initializing many verification instances based on processors cores numbers available to the mo...
متن کامل